0.03/0.11	% Problem    : SLH067^1 : TPTP v7.5.0. Released v7.5.0.
0.03/0.13	% Command    : run_E %s %d THM
0.14/0.34	% Computer : n006.cluster.edu
0.14/0.34	% Model    : x86_64 x86_64
0.14/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory   : 8042.1875MB
0.14/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 30
0.14/0.34	% WCLimit    : 30
0.14/0.34	% DateTime   : Tue Aug  9 02:19:44 EDT 2022
0.14/0.34	% CPUTime    : 
0.20/0.46	The problem SPC is TH0_THM_EQU_NAR
0.20/0.46	Running higher-order on 1 cores theorem proving
0.20/0.46	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.46	# Version: 3.0pre003-ho
0.20/0.48	# Preprocessing class: HSLSSMSSSSSNHFA.
0.20/0.48	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.20/0.48	# Starting new_ho_10 with 30s (1) cores
0.20/0.48	# new_ho_10 with pid 31477 completed with status 0
0.20/0.48	# Result found by new_ho_10
0.20/0.48	# Preprocessing class: HSLSSMSSSSSNHFA.
0.20/0.48	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.20/0.48	# Starting new_ho_10 with 30s (1) cores
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Search class: HGHSM-FFMF33-SHFFFSBN
0.20/0.48	# partial match(3): HGUSM-FFMF32-SHFFMSBN
0.20/0.48	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
0.20/0.48	# Starting new_ho_10 with 7s (1) cores
0.20/0.48	# new_ho_10 with pid 31478 completed with status 0
0.20/0.48	# Result found by new_ho_10
0.20/0.48	# Preprocessing class: HSLSSMSSSSSNHFA.
0.20/0.48	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.20/0.48	# Starting new_ho_10 with 30s (1) cores
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Search class: HGHSM-FFMF33-SHFFFSBN
0.20/0.48	# partial match(3): HGUSM-FFMF32-SHFFMSBN
0.20/0.48	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
0.20/0.48	# Starting new_ho_10 with 7s (1) cores
0.20/0.48	# Preprocessing time       : 0.002 s
0.20/0.48	# Presaturation interreduction done
0.20/0.48	
0.20/0.48	# Proof found!
0.20/0.48	# SZS status Theorem
0.20/0.48	# SZS output start CNFRefutation
0.20/0.48	thf(decl_22, type, if_o_a: $o > ($o > a) > ($o > a) > $o > a).
0.20/0.48	thf(decl_23, type, if_a: $o > a > a > a).
0.20/0.48	thf(decl_24, type, ord_less_o_a: ($o > a) > ($o > a) > $o).
0.20/0.48	thf(decl_25, type, ord_less_eq_o_o_a: ($o > $o > a) > ($o > $o > a) > $o).
0.20/0.48	thf(decl_26, type, ord_less_eq_o_a: ($o > a) > ($o > a) > $o).
0.20/0.48	thf(decl_27, type, ord_less_eq_a: a > a > $o).
0.20/0.48	thf(decl_28, type, refine735398609_a_o_a: ($o > a) > ($o > a) > $o).
0.20/0.48	thf(decl_29, type, refine19784377GN_a_a: a > a > $o).
0.20/0.48	thf(decl_30, type, refine1607546353MP_o_a: ($o > a) > ($o > a) > $o).
0.20/0.48	thf(decl_31, type, refine2039862616SIMP_a: a > a > $o).
0.20/0.48	thf(decl_32, type, b: $o).
0.20/0.48	thf(decl_33, type, e: a).
0.20/0.48	thf(decl_34, type, m: a).
0.20/0.48	thf(decl_35, type, t: a).
0.20/0.48	thf(decl_36, type, epred1_2: ($o > a) > ($o > a) > $o).
0.20/0.48	thf(decl_37, type, epred2_2: ($o > a) > ($o > a) > $o).
0.20/0.48	thf(decl_38, type, esk1_4: ($o > a) > (a > $o > a) > a > a > a).
0.20/0.48	thf(decl_39, type, esk2_4: ($o > a) > (a > $o > a) > a > a > a).
0.20/0.48	thf(decl_40, type, esk3_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a).
0.20/0.48	thf(decl_41, type, esk4_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a).
0.20/0.48	thf(decl_42, type, esk5_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a).
0.20/0.48	thf(decl_43, type, esk6_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a).
0.20/0.48	thf(decl_44, type, esk7_4: a > (a > a) > a > a > a).
0.20/0.48	thf(decl_45, type, esk8_4: a > (a > a) > a > a > a).
0.20/0.48	thf(decl_46, type, esk9_4: a > a > (a > $o > a) > ($o > a) > a).
0.20/0.48	thf(decl_47, type, esk10_4: a > a > (a > $o > a) > ($o > a) > a).
0.20/0.48	thf(decl_48, type, esk11_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a).
0.20/0.48	thf(decl_49, type, esk12_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a).
0.20/0.48	thf(decl_50, type, esk13_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a).
0.20/0.48	thf(decl_51, type, esk14_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a).
0.20/0.48	thf(decl_52, type, esk15_4: a > a > (a > a) > a > a).
0.20/0.48	thf(decl_53, type, esk16_4: a > a > (a > a) > a > a).
0.20/0.48	thf(conj_2, conjecture, (ord_less_eq_a @ (if_a @ ((b)) @ t @ e) @ m), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_2)).
0.20/0.48	thf(conj_1, hypothesis, (~((b))=>(ord_less_eq_a @ e @ m)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_1)).
0.20/0.48	thf(help_If_1_1_If_001tf__a_T, axiom, ![X85:a, X79:a]:(((if_a @ (($true)) @ X85 @ X79)=(X85))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', help_If_1_1_If_001tf__a_T)).
0.20/0.48	thf(conj_0, hypothesis, ((b)=>(ord_less_eq_a @ t @ m)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
0.20/0.48	thf(help_If_2_1_If_001tf__a_T, axiom, ![X84:a, X79:a]:(((if_a @ (~($true)) @ X84 @ X79)=(X79))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', help_If_2_1_If_001tf__a_T)).
0.20/0.48	thf(c_0_5, negated_conjecture, ~(((~(b)|(ord_less_eq_a @ (if_a @ $true @ t @ e) @ m))&((b)|(ord_less_eq_a @ (if_a @ $false @ t @ e) @ m)))), inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[conj_2])])).
0.20/0.48	thf(c_0_6, hypothesis, (~(b)=>(ord_less_eq_a @ e @ m)), inference(fof_simplification,[status(thm)],[conj_1])).
0.20/0.48	thf(c_0_7, negated_conjecture, (((~(b)|(b))&(~(ord_less_eq_a @ (if_a @ $false @ t @ e) @ m)|(b)))&((~(b)|~(ord_less_eq_a @ (if_a @ $true @ t @ e) @ m))&(~(ord_less_eq_a @ (if_a @ $false @ t @ e) @ m)|~(ord_less_eq_a @ (if_a @ $true @ t @ e) @ m)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
0.20/0.48	thf(c_0_8, plain, ![X322:a, X323:a]:(((if_a @ (($true)) @ X322 @ X323)=(X322))), inference(variable_rename,[status(thm)],[help_If_1_1_If_001tf__a_T])).
0.20/0.48	thf(c_0_9, hypothesis, (~(b)|(ord_less_eq_a @ t @ m)), inference(fof_nnf,[status(thm)],[conj_0])).
0.20/0.48	thf(c_0_10, plain, ![X320:a, X321:a]:(((if_a @ (~($true)) @ X320 @ X321)=(X321))), inference(variable_rename,[status(thm)],[help_If_2_1_If_001tf__a_T])).
0.20/0.48	thf(c_0_11, hypothesis, ((b)|(ord_less_eq_a @ e @ m)), inference(fof_nnf,[status(thm)],[c_0_6])).
0.20/0.48	thf(c_0_12, negated_conjecture, (~((b))|~((ord_less_eq_a @ (if_a @ (($true)) @ t @ e) @ m))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_13, plain, ![X11:a, X10:a]:(((if_a @ (($true)) @ X10 @ X11)=(X10))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.48	thf(c_0_14, hypothesis, ((ord_less_eq_a @ t @ m)|~((b))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.48	thf(c_0_15, plain, ![X10:a, X11:a]:(((if_a @ (((($true))!=(($true)))) @ X10 @ X11)=(X11))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.48	thf(c_0_16, hypothesis, ((b)|(ord_less_eq_a @ e @ m)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.48	thf(c_0_17, negated_conjecture, ~((b)), inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
0.20/0.48	thf(c_0_18, negated_conjecture, ((b)|~((ord_less_eq_a @ (if_a @ (~($true)) @ t @ e) @ m))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.48	thf(c_0_19, plain, ![X10:a, X11:a]:(((if_a @ (~($true)) @ X10 @ X11)=(X11))), inference(cn,[status(thm)],[c_0_15])).
0.20/0.48	thf(c_0_20, hypothesis, (ord_less_eq_a @ e @ m), inference(sr,[status(thm)],[c_0_16, c_0_17])).
0.20/0.48	thf(c_0_21, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_20])]), c_0_17]), ['proof']).
0.20/0.48	# SZS output end CNFRefutation
0.20/0.48	# Parsed axioms                        : 52
0.20/0.48	# Removed by relevancy pruning/SinE    : 0
0.20/0.48	# Initial clauses                      : 83
0.20/0.48	# Removed in clause preprocessing      : 29
0.20/0.48	# Initial clauses in saturation        : 54
0.20/0.48	# Processed clauses                    : 18
0.20/0.48	# ...of these trivial                  : 1
0.20/0.48	# ...subsumed                          : 0
0.20/0.48	# ...remaining for further processing  : 17
0.20/0.48	# Other redundant clauses eliminated   : 1
0.20/0.48	# Clauses deleted for lack of memory   : 0
0.20/0.48	# Backward-subsumed                    : 1
0.20/0.48	# Backward-rewritten                   : 4
0.20/0.48	# Generated clauses                    : 2
0.20/0.48	# ...of the previous two non-redundant : 4
0.20/0.48	# ...aggressively subsumed             : 0
0.20/0.48	# Contextual simplify-reflections      : 1
0.20/0.48	# Paramodulations                      : 0
0.20/0.48	# Factorizations                       : 0
0.20/0.48	# NegExts                              : 0
0.20/0.48	# Equation resolutions                 : 1
0.20/0.48	# Propositional unsat checks           : 0
0.20/0.48	#    Propositional check models        : 0
0.20/0.48	#    Propositional check unsatisfiable : 0
0.20/0.48	#    Propositional clauses             : 0
0.20/0.48	#    Propositional clauses after purity: 0
0.20/0.48	#    Propositional unsat core size     : 0
0.20/0.48	#    Propositional preprocessing time  : 0.000
0.20/0.48	#    Propositional encoding time       : 0.000
0.20/0.48	#    Propositional solver time         : 0.000
0.20/0.48	#    Success case prop preproc time    : 0.000
0.20/0.48	#    Success case prop encoding time   : 0.000
0.20/0.48	#    Success case prop solver time     : 0.000
0.20/0.48	# Current number of processed clauses  : 10
0.20/0.48	#    Positive orientable unit clauses  : 6
0.20/0.48	#    Positive unorientable unit clauses: 0
0.20/0.48	#    Negative unit clauses             : 1
0.20/0.48	#    Non-unit-clauses                  : 3
0.20/0.48	# Current number of unprocessed clauses: 39
0.20/0.48	# ...number of literals in the above   : 122
0.20/0.48	# Current number of archived formulas  : 0
0.20/0.48	# Current number of archived clauses   : 6
0.20/0.48	# Clause-clause subsumption calls (NU) : 12
0.20/0.48	# Rec. Clause-clause subsumption calls : 12
0.20/0.48	# Non-unit clause-clause subsumptions  : 1
0.20/0.48	# Unit Clause-clause subsumption calls : 4
0.20/0.48	# Rewrite failures with RHS unbound    : 0
0.20/0.48	# BW rewrite match attempts            : 2
0.20/0.48	# BW rewrite match successes           : 2
0.20/0.48	# Condensation attempts                : 18
0.20/0.48	# Condensation successes               : 0
0.20/0.48	# Termbank termtop insertions          : 5895
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.009 s
0.20/0.48	# System time              : 0.003 s
0.20/0.48	# Total time               : 0.012 s
0.20/0.48	# Maximum resident set size: 2096 pages
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.012 s
0.20/0.48	# System time              : 0.004 s
0.20/0.48	# Total time               : 0.016 s
0.20/0.48	# Maximum resident set size: 1740 pages
0.20/0.48	EOF